منابع مشابه
A Partial Matching Framework Based on Set Exclusion Criteria
This article introduces a partial matching framework, based on set theory criteria, for the measurement of shape similarity. The matching framework is described in an abstract way because the proposed scheme is independent of the selection of a segmentation method and feature space. This paradigm ensures the high adaptability of the algorithm and brings the implementer a wide control over the r...
متن کاملML Partial Evaluation using Set-Based Analysis
We describe the design and implementation of an off-line partial evaluator for Standard ML programs. Our partial evaluator consists of two phases: analysis and specialization. Analysis: Set-based analysis is used to compute control flow, data flow and binding-time information. It provides a combination of speed and accuracy that is well suited to partial-evaluation applications: the analysis pr...
متن کاملWorkflow Modelling Based on Synchrony
Prof. Carl Adam Petri wrote: “In order to apply net theory with success, a user of net theory can just rely on the fact that every net which he can specify explicitly (draw on paper) can be connected by a short (≤ 4) chain of net morphisms to the physical real word; your net is, in a very precise sense, physically implementable.” (Status Report On Net Theory, 1989, a forward for my book Petri N...
متن کاملPartial Security and Timeliness in Real-Time Database Systems
A real-time system is one whose basic speciication and design correctness arguments must include its ability to meet its timing constraints. This implies that its correctness depends not only on the logical correctness, but also on the timeliness of its actions. Typically, real-time systems are associated with critical applications, in which h uman lives or expensive machinery may be at stake. ...
متن کاملOn Partial Covering For Geometric Set Systems
We study a generalization of the Set Cover problem called the Partial Set Cover in the context of geometric set systems. The input to this problem is a set system (X ,S), where X is a set of elements and S is a collection of subsets of X , and an integer k ≤ |X |. The goal is to cover at least k elements of X by using a minimum-weight collection of sets from S. In the geometric version, X typic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2012
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-012-0158-8